Optimal city hierarchy: A dynamic programming approach to central place theory
نویسندگان
چکیده
منابع مشابه
Optimal city hierarchy: A dynamic programming approach to central place theory
Central place theory is a key building block of economic geography and an empirically plausible description of city systems. This paper provides a rationale for central place theory via a dynamic programming formulation of the social planner’s problem of city hierarchy. We show that there must be one and only one immediate smaller city between two neighboring larger-sized cities in any optimal ...
متن کاملCentral Place Theory and City Size Distribution
This paper proposes a theory of city size distribution via a hierarchy approach rather than the popular random growth process. It does so by formalizing central place theory using an equilibrium entry model and specifying the conditions under which city size distribution follows a power law. Central place theory describes the way in which a hierarchical city system with different layers of citi...
متن کاملa benchmarking approach to optimal asset allocation for insurers and pension funds
uncertainty in the financial market will be driven by underlying brownian motions, while the assets are assumed to be general stochastic processes adapted to the filtration of the brownian motions. the goal of this study is to calculate the accumulated wealth in order to optimize the expected terminal value using a suitable utility function. this thesis introduced the lim-wong’s benchmark fun...
15 صفحه اولA Numerical Approach to Stochastic Optimal Control via Dynamic Programming
This paper presents a strategy for finding optimal controls of nonlinear systems subject to random excitations. The method is capable to generate global control solutions when state and control constraints are present. The solution is global in the sense that controls for all initial conditions in a region of the state space are obtained. The approach is based on the Bellman’s Principle of opti...
متن کاملA dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Economic Theory
سال: 2014
ISSN: 0022-0531
DOI: 10.1016/j.jet.2014.09.018